Better Lower Bounds for Monotone Threshold Formulas
نویسندگان
چکیده
منابع مشابه
Better Lower Bounds for Monotone Threshold Formulas
We show that every monotone formula that computes the threshold function THk,n, 2 ≤ k ≤ n2 , has size at least ⌊ k 2 ⌋ n log( n k−1 ). The same lower bound is shown to hold in the stronger monotone directed contact networks model.
متن کاملLower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Much work has been done on learning various classes of “simple” monotone functions under the uniform distribution. In this paper we give the first unconditional lower bounds for learning problems of this sort by showing that polynomial-time algorithms cannot learn constant-depth monotone Boolean formulas under the uniform distribution in the well-studied Statistical Query model. Using a recent ...
متن کاملMonotone Boolean formulas can approximate monotone linear threshold functions
We show that any monotone linear threshold function on n Boolean variables can be approximated to within any constant accuracy by a monotone Boolean formula of poly(n) size.
متن کاملLower Bounds for Monotone Counting Circuits
A {+,×}-circuit counts a given multivariate polynomial f , if its values on 0-1 inputs are the same as those of f ; on other inputs the circuit may output arbitrary values. Such a circuit counts the number of monomials of f evaluated to 1 by a given 0-1 input vector (with multiplicities given by their coefficients). A circuit decides f if it has the same 0-1 roots as f . We first show that some...
متن کاملSuperpolynomial Lower Bounds for Monotone Span Programs
In this paper we obtain the first superpolynomial lower bounds for monotone span programs computing explicit functions. The best previous lower bound was Ω(n) by Beimel, Gál, Paterson [BGP]; our proof exploits a general combinatorial lower bound criterion from that paper. Our lower bounds are based on an analysis of Paley-type bipartite graphs via Weil’s character sum estimates. We prove an n n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1997
ISSN: 0022-0000
DOI: 10.1006/jcss.1997.1287